Sieving random iterative function systems
نویسندگان
چکیده
It is known that backward iterations of independent copies a contractive random Lipschitz function converge almost surely under mild assumptions. By sieving (or thinning) procedure based on adding to the functions time and space components, it possible construct scale invariant stochastic process. We study its distribution paths properties. In particular, we show càdlàg has finite total variation. also provide examples analyse various properties particular sieved iterative systems including perpetuities infinite Bernoulli convolutions, maximum, continued fractions.
منابع مشابه
Sieving in Function Fields
We present the rst implementation of sieving techniques in the context of function elds. More precisely, we compute in class groups of quadratic congruence function elds by combining the Algorithm of Hafner and McCurley with sieving ideas known from factoring. We apply our methods to compute generators and relations of the Jacobian variety of hyperelliptic curves over nite elds.
متن کاملSieving, Property Τ , and Random 3-manifolds
These are notes for a talk I gave in the Group theory seminar during the Fall of 2007 at the University of Wisconsin. The goal is to introduce the reader to the method of sieving from analytic number theory in the context of arithmetic groups. We do this by discussing properties of Random 3-Manifolds which were studied by Dunfeld and Thurston [2]. The primary source for this talk is Kowalski’s ...
متن کاملBlock Sieving Algorithms Block Sieving Algorithms
Quite similiar to the Sieve of Erastosthenes, the best-known general algorithms for fac-toring large numbers today are memory-bounded processes. We develop three variations of the sieving phase and discuss them in detail. The fastest modiication is tailored to RISC processors and therefore especially suited for modern workstations and massively parallel supercomputers. For a 116 decimal digit c...
متن کاملA Study on Partitioned Iterative Function Systems for Image Compression
The technique of image compression using Iterative Function System IFS is known as fractal image compression An extension of IFS theory is called as Partitioned or local Iterative Function System PIFS for coding the gray level images The theory of PIFS appears to be di erent from that of IFS in the sense of application domain Assuming the theory of PIFS is same as that of IFS several techniques...
متن کاملSpatial representation of symbolic sequences through iterative function systems
Jeerey 10] proposed a graphic representation of DNA sequences using Barns-ley's iterative function systems. In spite of further developments in this direction 19, 25, 13], the proposed graphic representation of DNA sequences has been lacking a rigorous connection between its spatial scaling characteristics and the statistical characteristics of the DNA sequences themselves. We 1) generalize Jee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bernoulli
سال: 2021
ISSN: ['1573-9759', '1350-7265']
DOI: https://doi.org/10.3150/20-bej1221